Suboptimal model reduction using LMIs with convex constraints, Report no. LiTH-ISY-R-2759
نویسندگان
چکیده
An approach to model reduction of LTI systems using Linear Matrix Inequalities (LMIs) in an H∞ framework is presented, where non-convex constraints are replaced with stricter convex constraints thus making it suboptimal. The presented algorithms are compared with the Optimal Hankel reduction algorithm, and are shown to achieve better results (i.e lower H∞-errors) in cases where some of the Hankel singular values are close, but not equal to each other.
منابع مشابه
Convex Optimization approach for Time-Optimal Path Tracking of Robots with Speed Dependent Constraints, Report no. LiTH-ISY-R-2970
The task of generating time optimal trajectories for a six degrees of freedom industrial robot is discussed in the paper and an existing convex optimization formulation of the problem is extended to include new types of constraints. The new constraints are speed dependent and can be motivated from physical modeling of the motors and the drive system. It is shown how the speed dependent constrai...
متن کاملRobust finite-frequency H2 analysis, Report no. LiTH-ISY-R-2973
Finite-frequency H2 analysis is relevant to a number of problems in which a priori information is available on the frequency domain of interest. This paper addresses the problem of analyzing robust finite-frequency H2 performance of systems with structured uncertainties. An upper bound on this measure is provided by exploiting convex optimization tools for robustness analysis and the notion of ...
متن کاملModel Reduction using a Frequency-Limited H2-Cost, Report no. LiTH-ISY-R-3045
We propose a method for model reduction on a given frequency range, without having to specify input and output filter weights. The method uses a nonlinear optimization approach where we formulate a H2 like cost function which only takes the given frequency range into account. We derive a gradient of the proposed cost function which enables us to use off-the-shelf optimization software.
متن کاملClustering using sum-of-norms regularization; with application to particle filter output computation, Report no. LiTH-ISY-R-2993
We present a novel clustering method, SON clustering, formulated as a convex optimization problem. The method is based on over-parameterization and uses a sum-of-norms regularization to control the trade-o between the model t and the number of clusters. Hence, the number of clusters can be automatically adapted to best describe the data, and need not to be speci ed a priori. We apply SON cluste...
متن کاملOn Polynomial Coefficients and Rank Constraints, Report no. LiTH-ISY-R-2867
Rank constraints on matrices emerge in many automatic control applications. In this short document we discuss how to rewrite the constraint into a polynomial equations of the elements in a the matrix. If addition semidefinite matrix constraints are included, the polynomial equations can be turned into an inequality. We also briefly discuss how to implement these polynomial constraints.
متن کامل